Flexibility but no coordination of visits in provisioning riflemen
نویسندگان
چکیده
منابع مشابه
Flexibility but no coordination of visits in provisioning riflemen
http://dx.doi.org/10.1016/j.anbehav.2016.12.021 0003-3472/© 2017 The Authors. Published by Elsevie license (http://creativecommons.org/licenses/by/4.0/) Parental care strategies occupy a continuum from fixed investments that are consistent across contexts to flexible behaviour that largely depends on external social and environmental cues. Determining the flexibility of care behaviour is import...
متن کاملcoordination of protective schemes in distribution and subtransmission systems including distributed generation
نصب منابع پراکنده در سیستم های توزیع و فوق توزیع علاوه بر مزیت های فراوان، مشکلاتی را هم به همراه دارد. یکی از این مشکلات تأثیر این منابع روی اندازه جریان های اتصال کوتاه است. به طور معمول از حفاظت های مبتنی بر اصل جریان زیاد در سیستم های توزیع و فوق توزیع استفاده می شود. از مهمترین طرح های حفاظتی استفاده شده در فیدرهای توزیع، حفاظت فیوز- ریکلوزر است. همچنین از طرح های حفاظتی جریان زیاد جهتی در...
Enhanced Coordination in Sensor Networks through Flexible Service Provisioning
Heterogeneous wireless sensor networks represent a challenging programming environment. Servilla addresses this by offering a new middleware framework that provides service provisioning. Using Servilla, developers can construct platform-independent applications over a dynamic set of devices with diverse computational resources and sensors. A salient feature of Servilla is its support for dynami...
متن کاملFlexibility: Change, but Change What?
Enterprises need to be flexible to adjust their behavior to changing environment conditions. To be flexible requires introspection and action capabilities. The members of the enterprise need to understand what they do, what needs to change and, eventually, they need to deploy the changes. In this presentation, we introduce some key concepts for understanding the flexibility process as described...
متن کاملParallel Search with No Coordination
We consider a parallel version of a classical Bayesian search problem. k agents are looking for a treasure that is placed in one of the boxes indexed by N according to a known distribution p. The aim is to minimize the expected time until the first agent finds it. Searchers run in parallel where at each time step each searcher can “peek” into a box. A basic family of algorithms which are inhere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Animal Behaviour
سال: 2017
ISSN: 0003-3472
DOI: 10.1016/j.anbehav.2016.12.021